|
|- | align="center" | transcription of the indian numerals |} |- | align="center" colspan="2" | Most-perfect magic square from the Parshvanath Jain temple in Khajuraho |} A most-perfect magic square of order ''n'' is a magic square containing the numbers 1 to ''n''2 with two additional properties: # Each 2×2 subsquare sums to 2''s'', where ''s'' = ''n''2 + 1. # All pairs of integers distant ''n''/2 along a (major) diagonal sum to ''s''. ==Examples== Specific examples of most-perfect magic squares that begin with the 2015 date demonstrate how theory and computer science are able to define this group of magic squares. 〔F1 Compiler http://www.f1compiler.com/samples/Most%20Perfect%20Magic%20Square%208x8.f1.html〕 〔Harry White, http://users.eastlink.ca/~sharrywhite/Most-perfect.html〕 Only a fraction of the 2x2 cell blocks that sum to 130 are accented by the different colored fonts in the 8x8 example. The 12x12 square below was found by making all the 42 principal reversible squares with ReversibleSquares, running Transform1 2All on all 42, making 23040 of each, (of the 23040 x 23040 total each), then making the most-perfect squares from these with ReversibleMost-Perfect. These squares were then scanned for squares with 20,15 in the proper cells for any of the 8 rotations. The 2015 squares all originated with principal reversible square number #31. This square has values that sum to 35 on opposite sides of the vertical midline in the first two rows.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Most-perfect magic square」の詳細全文を読む スポンサード リンク
|